Monte Carlo Tree Search as an intelligent search tool in structural design problems

نویسندگان

چکیده

Abstract Monte Carlo Tree Search (MCTS) is a search technique that in the last decade emerged as major breakthrough for Artificial Intelligence applications regarding board- and video-games. In 2016, AlphaGo, an MCTS-based software agent, outperformed human world champion of board game Go. This was long considered almost infeasible machines, due to its immense space need long-term strategy. Since this historical success, MCTS effective new approach many other scientific technical problems. Interestingly, civil structural engineering, discipline, offers tasks whose solution may benefit from intelligent particular adopting tool. work, we show how can be adapted suitable solutions engineering design problem. The problem consists choosing load-bearing elements reference reinforced concrete structure, so achieve set specific dynamic characteristics. paper, report results obtained by applying both plain hybrid version single-agent MCTS. integration classic Genetic Algorithm (GA), latter also serving term comparison results. study’s outcomes open perspectives adoption tool engineers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monte-Carlo Tree Search

representation of the game. It was programmed in LISP. Further use of abstraction was also studied by Friedenbach (1980). The combination of search, heuristics, and expert systems led to the best programs in the eighties. At the end of the eighties a new type of Go programs emerged. These programs made an intensive use of pattern recognition. This approach was discussed in detail by Boon (1990)...

متن کامل

An Analysis of Monte Carlo Tree Search

Monte Carlo Tree Search (MCTS) is a family of directed search algorithms that has gained widespread attention in recent years. Despite the vast amount of research into MCTS, the effect of modifications on the algorithm, as well as the manner in which it performs in various domains, is still not yet fully known. In particular, the effect of using knowledgeheavy rollouts in MCTS still remains poo...

متن کامل

Parallel Monte-Carlo Tree Search

Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techni...

متن کامل

Monte-Carlo Tree Search Solver

Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (LOA). A new MCTS variant, called MCTS-Solver, has been designed to play narrow tactical lines better in sudden-death games such as LOA. The variant differs from the traditional MCTS in respect to backpropagation and se...

متن کامل

Monte-Carlo Tree Search in Production Management Problems

Classical search algorithms rely on the existence of a sufficiently powerful evaluation function for non-terminal states. In many task domains, the development of such an evaluation function requires substantial effort and domain knowledge, or is not even possible. As an alternative in recent years, Monte-Carlo evaluation has been succesfully applied in such task domains. In this paper, we appl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering With Computers

سال: 2021

ISSN: ['0177-0667', '1435-5663']

DOI: https://doi.org/10.1007/s00366-021-01338-2